Structural Properties of XPath Fragments
نویسندگان
چکیده
We study structural properties of each of the mainsublanguages of XPath [8] commonly used in practice.First, we characterize the expressive power of these lan-guage fragments in terms of both logics and tree pat-terns. Second, we investigate closure properties, fo-cusing on the ability to perform basic Boolean oper-ations while remaining within the fragment. We give acomplete picture of the closure properties of these frag-ments, treating XPath expressions both as functions ofarbitrary nodes in a document tree, and as functionsthat are applied only at the root of the tree. Finally,we provide sound and complete axiom systems and nor-mal forms for several of these fragments. These resultsare useful for simpli cation of XPath expressions andoptimization of XML queries.
منابع مشابه
An XPath Algebraic Characterization of A ( k ) and P ( k ) Indices with Applications to Query Processing
Recent studies have proposed structural summary techniques for path query evaluation on semi-structured data sources. One major line of this research has been the introduction of the DataGuide, 1-index, 2-index, and A(k) indices, and subsequent investigations and generalizations. Another recent study has considered structural characterizations of fragments of XPath, the standard path navigation...
متن کاملCoupling Fragments of XPath with XML Indexing and Query Decomposition
Recent studies have proposed structural summary techniques for pathquery evaluation on semi-structured data sources. One major line of this research has been the introduction of the DataGuide, 1-index, 2-index, and A(k) indices, and subsequent investigations and generalizations. Another recent study has considered structural characterizations of fragments of XPath, the standard path navigation ...
متن کاملImproving the Efficiency of XPath Execution on Relational Systems
This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern SQL query processors, exploits XML schema information and has low implementation complexity. The method is based on the splitting of XPath expressions into Primary Path Fragments (PPFs) and their subsequent combination ...
متن کاملSatisfiability of Simple XPath Fragments under Duplicate-Free DTDs
In this paper, we consider the XPath satisfiability problem under restricted DTDs called “duplicate free”. For an XPath expression q and a DTD D, q is satisfiable under D if there exists an XML document t such that t is valid against D and that the answer of q on t is nonempty. Evaluating an unsatisfiable XPath expression is meaningless, since such an expression can always be replaced by an emp...
متن کاملXPath Query Satisfiability is in PTIME for Real-World DTDs
The problem of XPath query satisfiability under DTDs (Document Type Definitions) is to decide, given an XPath query p and a DTD D, whether or not there is some document valid with respect to D on which p returns a nonempty result. Recent studies in the literature have shown the problem to be NP-hard or worse for most fragments of XPath. However, in this paper we show that the satisfiability pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 336 شماره
صفحات -
تاریخ انتشار 2003